package com.matrix.java.chap_06.example;

import java.util.Scanner;

/*
    GreatestCommonDivisorMethod.java
 */
public class Case6_06 {
    /**
     * Main method
     */
    public static void main(String[] args) {
        // Create a Scanner
        Scanner input = new Scanner(System.in);
        // Prompt the user to enter two integers
        System.out.print("Enter first integer: ");
        int n1 = input.nextInt();
        System.out.print("Enter first integer: ");
        int n2 = input.nextInt();
        input.close();
        System.out.println("The greatest common divisor for " + n1 +
                " and " + n2 + " is " + gcd(n1, n2));
    }

    /**
     * Return the gcd of two integers
     */
    private static int gcd(int n1, int n2) {
        int gcd = 1;// Initial gcd is 1
        int k = 2;//Possible gcd
        while (k <= n1 && k <= n2) {
            if (n1 % k == 0 && n2 % k == 0) {
                gcd = k;//Update gcd
            }
            k++;
        }
        return gcd;//Return gcd
    }
}
